#include "types.h"
#include "defs.h"
#include "param.h"
#include "memlayout.h"
#include "mmu.h"
#include "x86.h"
#include "proc.h"
#include "spinlock.h"


// Modificado. Agregamos una nueva estructura cola. MLF
struct queue{
  struct proc *first, *last;
  int size;  // Para saber el tamanio de cada nivel

};

struct {
  struct spinlock lock;
  struct proc proc[NPROC];
  struct queue mlf[MLF_LEVELS];  // Modificado. Ptable tiene ahora una cola MLF
  int size ;  // Modificado. para saber el tamanio de ptable
} ptable;

static struct proc *initproc;

int nextpid = 1;
extern void forkret(void);
extern void trapret(void);

static void wakeup1(void *chan);

// Modificado. Agregamos funcion sizeLevel
void
sizeLevels()
{
	if(ptable.mlf[0].size != 0 ||  ptable.mlf[1].size != 0 ||  ptable.mlf[2].size != 0 || ptable.mlf[3].size != 0 )
	{
		cprintf("nivel 0 : [%d] ; nivel 1 : [%d] ; nivel 2 : [%d] ; nivel 3 : [%d]  \n",ptable.mlf[0].size,ptable.mlf[1].size,ptable.mlf[2].size,ptable.mlf[3].size);
  	}	
}


// Modificado. Agregamos funcion UP
int
up(struct proc *p)
{
  int aux = ((p->current_level >0) ? p->current_level-1 : p->current_level);
//  cprintf("UP al proceso '%s' al level %d \n",p->name,aux);
  return aux;
}

// Modificado Agregamos funcion DOWN
int
down(struct proc *p)
{
  int aux = ((p->current_level < MLF_LEVELS-1)?p->current_level+1 : p->current_level);
//  cprintf("DOWN al proceso '%s' al level %d \n",p->name,aux);
  return aux;
}


// Modificado Agregamos funcion ENCOLAR
static void
encolar(struct proc *p,int level)
{
 ptable.size++;
  if( ptable.mlf[level].first == 0)
  {
    ptable.mlf[level].last = p;
    ptable.mlf[level].first = p;
    ptable.mlf[level].size++;
	p->current_level = level;
//  cprintf("Primer elemento en ptable.proc del nivel %d   \n",level);
  }
  else
  {
    ptable.mlf[level].last->next = p;
    ptable.mlf[level].last = p;
    ptable.mlf[level].size++;
	p->current_level = level;
//  cprintf("Encole un proceso en ptable.proc de nivel %d   \n",level);
  }
}

// Modificado Agregamos funcion DESENCOLAR
static void
desencolar(struct proc *p)
{
 ptable.size--;
  if(ptable.mlf[p->current_level].last->pid ==ptable.mlf[p->current_level].first->pid)
  {
    ptable.mlf[p->current_level].last = 0;
    ptable.mlf[p->current_level].first = 0;
    ptable.mlf[p->current_level].size--;
//  cprintf("Desencole el proceso de ptable.proc %s   \n",p->name);
  }
  else
  {
    ptable.mlf[p->current_level].first = p->next;
    ptable.mlf[p->current_level].size--;
//  cprintf("Desencole el proceso de ptable.proc %s   \n",p->name);
  }
}

// Modificado Agregamos funcion MAKE_RUNNABLE
static void
make_runnable(struct proc *p,int level)
{
  encolar(p,level);
  p->state= RUNNABLE;

}

// Modificado Agregamos funcion MAKE_RUNNING
static void
make_running(struct proc *p)
{
  desencolar(p);
  p->state= RUNNING;
}

// Modificado Agregamos funcion set_priority
void
set_priority(struct proc *p , int param)
{
	p->current_level = param;
	cprintf("----> name proc set_priority: %s \n",p->name);
}

void
pinit(void)
{
  initlock(&ptable.lock, "ptable");
}

//PAGEBREAK: 32
// Look in the process table for an UNUSED proc.
// If found, change state to EMBRYO and initialize
// state required to run in the kernel.
// Otherwise return 0.
static struct proc*
allocproc(void)
{
  struct proc *p;
  char *sp;
  acquire(&ptable.lock);
  for(p = ptable.proc; p < &ptable.proc[NPROC]; p++)
    if(p->state == UNUSED)
      goto found;
  release(&ptable.lock);
  return 0;

found:
  p->state = EMBRYO;
  p->pid = nextpid++;
  release(&ptable.lock);

  // Allocate kernel stack.
  if((p->kstack = kalloc()) == 0){
    p->state = UNUSED;
    return 0;
  }
  sp = p->kstack + KSTACKSIZE;

  // Leave room for trap frame.
  sp -= sizeof *p->tf;
  p->tf = (struct trapframe*)sp;

  // Set up new context to start executing at forkret,
  // which returns to trapret.
  sp -= 4;
  *(uint*)sp = (uint)trapret;

  sp -= sizeof *p->context;
  p->context = (struct context*)sp;
  memset(p->context, 0, sizeof *p->context);
  p->context->eip = (uint)forkret;
  return p;
}

//PAGEBREAK: 32
// Set up first user process.
void
userinit(void)
{
  struct proc *p;
  extern char _binary_initcode_start[], _binary_initcode_size[];
  ptable.mlf[0].size = 0;  // Modificado. Inicializamos los tamaños en 0 de los 4 niveles para usar en sizeLevel
  ptable.mlf[1].size = 0;
  ptable.mlf[2].size = 0;
  ptable.mlf[3].size = 0;
  p = allocproc();
  initproc = p;
  if((p->pgdir = setupkvm(kalloc)) == 0)
    panic("userinit: out of memory?");
  inituvm(p->pgdir, _binary_initcode_start, (int)_binary_initcode_size);
  p->sz = PGSIZE;
  memset(p->tf, 0, sizeof(*p->tf));
  p->tf->cs = (SEG_UCODE << 3) | DPL_USER;
  p->tf->ds = (SEG_UDATA << 3) | DPL_USER;
  p->tf->es = p->tf->ds;
  p->tf->ss = p->tf->ds;
  p->tf->eflags = FL_IF;
  p->tf->esp = PGSIZE;
  p->tf->eip = 0;  // beginning of initcode.S
  safestrcpy(p->name, "initcode", sizeof(p->name));
  p->cwd = namei("/");
  acquire(&ptable.lock); // Modificado. Controlamos race condition
  cprintf("----> name proc userinit: %s \n",p->name);
  make_runnable(p,0); // Modificado. Insertamos este metodo en lugar de la sentencia p->state = RUNNABLE;
  release(&ptable.lock);
}

// Grow current process's memory by n bytes.
// Return 0 on success, -1 on failure.
int
growproc(int n)
{
  uint sz;
  sz = proc->sz;
  if(n > 0){
    if((sz = allocuvm(proc->pgdir, sz, sz + n)) == 0)
      return -1;
  } else if(n < 0){
    if((sz = deallocuvm(proc->pgdir, sz, sz + n)) == 0)
      return -1;
  }
  proc->sz = sz;
  switchuvm(proc);
  return 0;
}

// Create a new process copying p as the parent.
// Sets up stack to return as if from system call.
// Caller must set state of returned proc to RUNNABLE.
int
fork(void)
{
  int i, pid;
  struct proc *np;

  // Allocate process.
  if((np = allocproc()) == 0)
    return -1;

  // Copy process state from p.
  if((np->pgdir = copyuvm(proc->pgdir, proc->sz)) == 0){
    kfree(np->kstack);
    np->kstack = 0;
    np->state = UNUSED;
    return -1;
  }
  np->sz = proc->sz;
  np->parent = proc;
  *np->tf = *proc->tf;

  // Clear %eax so that fork returns 0 in the child.
  np->tf->eax = 0;

  for(i = 0; i < NOFILE; i++)
    if(proc->ofile[i])
      np->ofile[i] = filedup(proc->ofile[i]);
  np->cwd = idup(proc->cwd);
  pid = np->pid;
  safestrcpy(np->name, proc->name, sizeof(proc->name));
  cprintf("----> name proc fork: %s \n",np->name);
  acquire(&ptable.lock);// Modificado. Hacemos un block para que make_runnable no entre en race condition
  make_runnable(np,0); // Modificado Insertamos este metodo en lugar de la sentencia np->state = RUNNABLE;
  release(&ptable.lock);
  return pid;
}

// Exit the current process.  Does not return.
// An exited process remains in the zombie state
// until its parent calls wait() to find out it exited.
void
exit(void)
{
  struct proc *p;
  int fd;

  if(proc == initproc)
    panic("init exiting");

  // Close all open files.
  for(fd = 0; fd < NOFILE; fd++){
    if(proc->ofile[fd]){
      fileclose(proc->ofile[fd]);
      proc->ofile[fd] = 0;
    }
  }

  iput(proc->cwd);
  proc->cwd = 0;

  acquire(&ptable.lock);

  // Parent might be sleeping in wait().
  wakeup1(proc->parent);

  // Pass abandoned children to init.
  for(p = ptable.proc; p < &ptable.proc[NPROC]; p++){
    if(p->parent == proc){
      p->parent = initproc;
      if(p->state == ZOMBIE)
        wakeup1(initproc);
    }
  }

  // Jump into the scheduler, never to return.
  proc->state = ZOMBIE;
  sched();
  panic("zombie exit");
}

// Wait for a child process to exit and return its pid.
// Return -1 if this process has no children.
int
wait(void)
{
  struct proc *p;
  int havekids, pid;

  acquire(&ptable.lock);
  for(;;){
    // Scan through table looking for zombie children.
    havekids = 0;
    for(p = ptable.proc; p < &ptable.proc[NPROC]; p++){
      if(p->parent != proc)
        continue;
      havekids = 1;
      if(p->state == ZOMBIE){
        // Found one.
        pid = p->pid;
        kfree(p->kstack);
        p->kstack = 0;
        freevm(p->pgdir);
        p->state = UNUSED;
        p->pid = 0;
        p->parent = 0;
        p->name[0] = 0;
        p->killed = 0;
        release(&ptable.lock);
        return pid;
      }
    }

    // No point waiting if we don't have any children.
    if(!havekids || proc->killed){
      release(&ptable.lock);
      return -1;
    }

    // Wait for children to exit.  (See wakeup1 call in proc_exit.)
    sleep(proc, &ptable.lock);  //DOC: wait-sleep
  }
}

//PAGEBREAK: 42
// Per-CPU process scheduler.
// Each CPU calls scheduler() after setting itself up.
// Scheduler never returns.  It loops, doing:
//  - choose a process to run
//  - swtch to start running that process
//  - eventually that process transfers control
//      via swtch back to the scheduler.
void
scheduler(void)
{

  struct proc *p;
  int indice;
  for(;;){
	  indice = 0;
      // Enable interrupts on this processor.
      sti();
     // Loop over process table looking for process to run.
      acquire(&ptable.lock);
      while(indice < MLF_LEVELS)    // Modificado. Con esto recorro los niveles de MLF
      {
      if(ptable.mlf[indice].first != 0)
	  {
			  p = ptable.mlf[indice].first; // Modificado. Trato el primer proceso de la nivel 'indice' de la tabla MLF
    		  if(p->state != RUNNABLE)
				panic("This proces is not RUNNABLE");  //Modificado. No puede ser no RUNNABLE el proceso
			   // Switch to chosen process.  It is the process's job
			  // to release ptable.lock and then reacquire it
			  // before jumping back to us.
			  proc = p;
			  switchuvm(p);
    		  make_running(p);   // Modificado Insertamos este metodo
    		  								// No hago mas el FOR del xv6 original por que esta funcion ya me esta avanzando cosumiendo el first
			  p->quantum = 0;
			  swtch(&cpu->scheduler, proc->context);
			  switchkvm();
			  // Process is done running for now.
			  // It should have changed its p->state before coming back.
	 	     proc = 0;
		}
        if(ptable.mlf[indice].first == 0	)  // Me aseguro que recorro todos los proceso de un nivel antes de avanzar
        	indice++;
	   }
	release(&ptable.lock);
  }
}



// Enter scheduler.  Must hold only ptable.lock
// and have changed proc->state.
void
sched(void)
{
  int intena;

  if(!holding(&ptable.lock))
    panic("sched ptable.lock");
  if(cpu->ncli != 1)
    panic("sched locks");
  if(proc->state == RUNNING)
    panic("sched running");
  if(readeflags()&FL_IF)
    panic("sched interruptible");
  intena = cpu->intena;
  swtch(&proc->context, cpu->scheduler);
  cpu->intena = intena;
}

// Give up the CPU for one scheduling round.
void
yield(void)
{
  acquire(&ptable.lock);  //DOC: yieldlock
 // cprintf("El proceso %s pasa a RUNNABLE por YIELD \n",proc->name);
  make_runnable(proc,down(proc));//baja de nivel en la cola
  //proc->state = RUNNABLE;
  sched();
  release(&ptable.lock);
}

// A fork child's very first scheduling by scheduler()
// will swtch here.  "Return" to user space.
void
forkret(void)
{
  static int first = 1;
  // Still holding ptable.lock from scheduler.
  release(&ptable.lock);


  if (first) {
    // Some initialization functions must be run in the context
    // of a regular process (e.g., they call sleep), and thus cannot
    // be run from main().
    first = 0;
    initlog();
  }

  // Return to "caller", actually trapret (see allocproc).
}

// Atomically release lock and sleep on chan.
// Reacquires lock when awakened.
void
sleep(void *chan, struct spinlock *lk)
{
  if(proc == 0)
    panic("sleep");

  if(lk == 0)
    panic("sleep without lk");

  // Must acquire ptable.lock in order to
  // change p->state and then call sched.
  // Once we hold ptable.lock, we can be
  // guaranteed that we won't miss any wakeup
  // (wakeup runs with ptable.lock locked),
  // so it's okay to release lk.
  if(lk != &ptable.lock){  //DOC: sleeplock0
    acquire(&ptable.lock);  //DOC: sleeplock1
    release(lk);
  }

  // Go to sleep.
  proc->chan = chan;
  proc->state = SLEEPING;
  sched();

  // Tidy up.
  proc->chan = 0;

  // Reacquire original lock.
  if(lk != &ptable.lock){  //DOC: sleeplock2
    release(&ptable.lock);
    acquire(lk);
  }
}

//PAGEBREAK!
// Wake up all processes sleeping on chan.
// The ptable lock must be held.
static void
wakeup1(void *chan)
{
  struct proc *p;

  for(p = ptable.proc; p < &ptable.proc[NPROC]; p++)
    if(p->state == SLEEPING && p->chan == chan)
    {
//      cprintf("El proceso %s pasa a RUNNABLE por WAKEUP \n",p->name);
      make_runnable(p,up(p)); //Modificado Insertamos este metodo en lugar de la sentencia de abajo. Sube de nivel
      //p->state = RUNNABLE;                                              
    }

}

// Wake up all processes sleeping on chan.
void
wakeup(void *chan)
{
  acquire(&ptable.lock);
  wakeup1(chan);
  release(&ptable.lock);
}

// Kill the process with the given pid.
// Process won't exit until it returns
// to user space (see trap in trap.c).
int
kill(int pid)
{
  struct proc *p;

  acquire(&ptable.lock);
  for(p = ptable.proc; p < &ptable.proc[NPROC]; p++){
    if(p->pid == pid){
      p->killed = 1;
      // Wake process from sleep if necessary.
      if(p->state == SLEEPING)
      {
        cprintf("El proceso %s pasa a RUNNABLE por KILL \n",p->name);
        make_runnable(p,p->current_level); //Modificado Insertamos este metodo en lugar de la sentencia de abajo. Queda el nivel q estaba
        //p->state = RUNNABLE;
      }
      release(&ptable.lock);
      return 0;
    }
  }
  release(&ptable.lock);
  return -1;
}

//PAGEBREAK: 36
// Print a process listing to console.  For debugging.
// Runs when user types ^P on console.
// No lock to avoid wedging a stuck machine further.
void
procdump(void)
{
  static char *states[] = {
  [UNUSED]    "unused",
  [EMBRYO]    "embryo",
  [SLEEPING]  "sleep ",
  [RUNNABLE]  "runble",
  [RUNNING]   "run   ",
  [ZOMBIE]    "zombie"
  };
  int i;
  struct proc *p;
  char *state;
  uint pc[10];

  for(p = ptable.proc; p < &ptable.proc[NPROC]; p++){
    if(p->state == UNUSED)
      continue;
    if(p->state >= 0 && p->state < NELEM(states) && states[p->state])
      state = states[p->state];
    else
      state = "???";
    cprintf("%d %s %s", p->pid, state, p->name);
    if(p->state == SLEEPING){
      getcallerpcs((uint*)p->context->ebp+2, pc);
      for(i=0; i<10 && pc[i] != 0; i++)
        cprintf(" %p", pc[i]);
    }
    cprintf("\n");
  }
}


